Phase field approximations of branched transportation problems
نویسندگان
چکیده
منابع مشابه
An Equivalent Path Functional Formulation of Branched Transportation Problems
We consider two models for branched transport: the one introduced in Bernot et al. (Publ Mat 49:417-451, 2005), which makes use of a functional defined on measures over the space of Lipschitz paths, and the path functional model presented in Brancolini et al. (J Eur Math Soc 8:415-434, 2006), where one minimizes some suitable action functional defined over the space of measure-valued Lipschitz ...
متن کاملStable phase field approximations of anisotropic solidification
We introduce unconditionally stable finite element approximations for a phase field model for solidification, which take highly anisotropic surface energy and kinetic effects into account. We hence approximate Stefan problems with anisotropic Gibbs–Thomson law with kinetic undercooling, and quasi-static variants thereof. The phase field model is given by θwt + λ %(φ)φt = ∇ . (b(φ)∇w) , cΨ a α %...
متن کاملConvergence of Phase–field Approximations to the Gibbs–thomson Law
We prove the convergence of phase-field approximations of the Gibbs–Thomson law. This establishes a relation between the first variation of the Van-der-Waals–Cahn–Hilliard energy and the first variation of the area functional. We allow for folding of diffuse interfaces in the limit and the occurrence of higher-multiplicities of the limit energy measures. We show that the multiplicity does not a...
متن کاملPhase-field approximations of the Willmore functional and flow
We discuss in this paper phase-field approximations of the Willmore functional and the associated L2-flow. After recollecting known results on the approximation of the Willmore energy and its L1 relaxation, we derive the expression of the flows associated with various approximations, and we show their behavior by formal arguments based on matched asymptotic expansions. We introduce an accurate ...
متن کاملBounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems
Bounds and approximate formulae are developed for the average optimum distance of the transportation linear programming problem with homogeneously but randomly distributed points and demands in a region of arbitrary shape. It is shown that if the region size grows with a fixed density of points then the cost per item is bounded from above in 3 dimensions (3-D), but not in 1-D and 2-D. Lower bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Calculus of Variations and Partial Differential Equations
سال: 2020
ISSN: 0944-2669,1432-0835
DOI: 10.1007/s00526-019-1680-3